bool DivideList(LinkNode*& L, ElemType x)	
	if (L->next==NULL) {
		printf("单链表不存在。\n");
		return false;
	}
	LinkNode* p = NULL, * q = NULL, * r = NULL;	
	p = L;
	while (!q) {
		q = (LinkNode*)malloc(sizeof(LinkNode));
	}
	r = q;	
	while (p->next) {
		if (p->next->data < x) {
			r->next = p->next;		
			r=r->next;				
			p->next= p->next->next;	
			r->next = NULL;			
		}
		else
			p = p->next;		
	}
	r->next = L->next;	
	L->next = q->next;	
	free(q);			
	return true;
}
